package leetcode

//https://leetcode.com/problems/delete-operation-for-two-strings/

fun main(args: Array<String>) {

}

/**
 * 实际就是寻找最长公共子序列
 */
fun minDistance1(word1: String, word2: String): Int {


    val lena = word1.length
    val lenb = word2.length
    val dp = Array(lena) { Array(lenb) { 0 } }

    return 1
}